Batch steganography and the threshold game
نویسنده
چکیده
In Batch Steganography we assume that a Steganographer has to choose how to allocate a fixed amount of data between a large number of covers. Given the existence of a steganalysis method for individual objects (satisfying certain assumptions) we assume that a Warden attempts to detect the payload by pooling the evidence from all the objects. This paper works out the details of a particular method for the Warden, which counts the number of objects of which the detection statistic surpasses a certain threshold. This natural pooling method leads to a game between the Warden and Steganographer, and there are different varieties depending on whether the moves are sequential or simultaneous. The solutions are intriguing, suggesting that the Steganographer should always concentrate the payload in as few covers as possible, or exactly the reverse, but never adopt an intermediate strategy. Furthermore, the Warden’s optimal strategies are instructive for the benchmarking of quantitative steganalysis methods. Experimental results show that some steganography and steganalysis methods’ empirical performance accords with this theory.
منابع مشابه
Perturbation Hiding and the Batch Steganography Problem
The batch steganography problem is how best to split a steganographic payload between multiple covers. This paper makes some progress towards an information-theoretic analysis of batch steganography by describing a novel mathematical abstraction we call perturbation hiding. As well as providing a new challenge for information hiding research, it brings into focus the information asymmetry in st...
متن کاملSteganographic strategies for a square distortion function
Recent results on the information theory of steganography suggest, and under some conditions prove, that the detectability of payload is proportional to the square of the number of changes caused by the embedding. Assuming that result in general, this paper examines the implications for an embedder when a payload is to be spread amongst multiple cover objects. A number of variants are considere...
متن کاملBatch Steganography and Pooled Steganalysis
Conventional steganalysis aims to separate cover objects from stego objects, working on each object individually. In this paper we investigate some methods for pooling steganalysis evidence, so as to obtain more reliable detection of steganography in large sets of objects, and the dual problem of hiding information securely when spreading across a batch of covers. The results are rather surpris...
متن کاملA New Acceptance Sampling Plan Based on Cumulative Sums of Conforming Run-Lengths
In this article, a novel acceptance-sampling plan is proposed to decide whether to accept or reject a receiving batch of items. In this plan, the items in the receiving batch are inspected until a nonconforming item is found. When the sum of two consecutive values of the number of conforming items between two successive nonconforming items falls underneath of a lower control threshold, the batc...
متن کامل